Generalizing Computability Theory to Abstract Algebras
نویسندگان
چکیده
We present a survey of our work over the last few decades on generalizations of computability theory to many-sorted algebras. The following topics are discussed, among others: (1) abstract v concrete models of computation for such algebras; (2) computability and continuity, and the use of many-sorted topological partial algebras, containing the reals; (3) comparisons between various equivalent and distinct models of computability; (4) generalized Church-Turing theses.
منابع مشابه
Abstract Computability, Algebraic Specification and Initiality
Computability and Algebraic Specifications Abstract Abstract computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all absract computable functions on any many-sorted algebra; and (ii) all functions effectively approximable by abstract ...
متن کاملUniversality and semicomputability for nondeterministic programming languages over abstract algebras
The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who proved the existence of a universal Turing machine for computations on strings over a finite alphabet. This stimulated the development of stored-program computers. Classical computability theory, including the UFT and the theory of semicomputable sets, has been extended by Tucker and Zucker to abstract ma...
متن کاملComputability of Operators on Continuous and Discrete Time Streams
A stream is a sequence of data indexed by time. The behaviour of natural and artificial systems can be modelled by streams and stream transformations. There are two distinct types of data stream: streams based on continuous time and streams based on discrete time. Having investigated case studies of both kinds separately, we have begun to combine their study in a unified theory of stream transf...
متن کاملConcrete Models of Computation for Topological Algebras
A concrete model of computation for a topological algebra is based on a representation of the algebra made from functions on the natural numbers. The functions computable in a concrete model are computable in the representation in the classical sense of the Chruch-Turing Thesis. Moreover, the functions turn out to be continuous in the topology of the algebra. In this paper we consider different...
متن کاملOrigins of our Theory of Computation on Abstract Data Types at the Mathematical Centre , Amsterdam , 1979 - 80
computation theories are based on “programs” that use the basic operations and tests of the algebra only. They may have different control or specification constructs, such as goto, recursion or parallelism. The programming languages that are used in semantical studies, like Jaco’s book, are all examples of abstract models of computation. One simply has to ask the question: What does this langua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015